Rumor Processes On
نویسندگان
چکیده
We study four discrete-time stochastic systems on N, modeling processes of rumor spreading. The involved individuals can either have an active or a passive role, speaking up or asking for the rumor. The appetite for spreading or hearing the rumor is represented by a set of random variables whose distributions may depend on the individuals. Our goal is to understand—based on the distribution of the random variables—whether the probability of having an infinite set of individuals knowing the rumor is positive or not.
منابع مشابه
Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading
We study gossip algorithms for the rumor spreading problem which asks one node to deliver a rumor to all nodes in an unknown network. We present the first protocol for any expander graph G with n nodes such that, the protocol informs every node in O(log n) rounds with high probability, and uses Õ(log n) random bits in total. The runtime of our protocol is tight, and the randomness requirement o...
متن کاملRumor Spreading in LiveJournal
Online social networks have gained importance in recent years. Furthermore, there is a need for designing smart applications for social networks which take into account the behaviour of dynamical processes over these networks. This requires structural knowledge of the network helpful in understanding the dynamical process. Here we study a broad category of such processes called rumor spreading ...
متن کاملGossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading | Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | Society for Industrial and Applied Mathematics
We study gossip algorithms for the rumor spreading problem which asks one node to deliver a rumor to all nodes in an unknown network, and every node is only allowed to call one neighbor in each round. In this work we introduce two fundamentally new techniques in studying the rumor spreading problem: First, we establish a new connection between the rumor spreading process in an arbitrary graph a...
متن کاملRandomness-Efficient Rumor Spreading
We study the classical rumor spreading problem, which is used to spread information in an unknown network with n nodes. We present the first protocol for any expander graph G with n nodes and minimum degree Θ(n) such that, the protocol informs every node in O(log n) rounds with high probability, and uses O(log n log log n) random bits in total. The runtime of our protocol is tight, and the rand...
متن کاملA computational model and convergence theorem for rumor dissemination in social networks
The spread of rumors, which are known as unverified statements of uncertain origin, may threaten the society and it's controlling, is important for national security councils of countries. If it would be possible to identify factors affecting spreading a rumor (such as agents’ desires, trust network, etc.) then, this could be used to slow down or stop its spreading. Therefore, a computational m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011